Optimal Packings of Two Ellipses in a Square
نویسندگان
چکیده
For each real number E in ]0, 1], we describe the densest packing PE of two non-overlapping congruent ellipses of aspect ratio E in a square. We find three different patterns as E belongs to ]0, 1/2], [1/2, E0] where E0 = √ (6 √ 3− 3)/11, and [E0, 1]. The technique of unavoidable sets – used by Friedman for proving the optimality of square packings – allows to prove the optimality of each packing PE .
منابع مشابه
Optimal Substructures in Optimal and Approximate Circle Packings
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle packings have given. Several known optimal and approximate circle packings contain optimal substructures. Based on this observation it is sometimes easy to determine the minimal polynomials of the arrangements.
متن کاملImproving Dense Packings of Equal Disks in a Square
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously studied cases of packing n equal disks in a square, the procedure confirms all the previous record packings [NO1] [NO2] [GL], except for n = 32, 37, 48, and 50 di...
متن کاملA comparison of jamming behavior in systems composed of dimer- and ellipse-shaped particles†
We compare the structural and mechanical properties of static packings composed of frictionless convex (ellipses) and concave (rigid dimers) particles in two dimensions. We employ numerical simulations to generate static packings and measure the shear stress in response to applied simple shear strain as a function of the aspect ratio and amount of compression. We find that the behavior near jam...
متن کاملGeneration of Optimal Packings from Optimal Packings
We define two notions of generation between the various optimal packings Qm of m congruent disks in a subset K of R2. The first one that we call weak generation consists in getting Qn by removing m − n disks from Qm and by displacing the n remaining congruent disks which grow continuously and do not overlap. During a weak generation of Qn from Qm, we consider the contact graphs G(t) of the inte...
متن کاملNeighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II. Applications to ellipses and ellipsoids
We apply the algorithm presented in the first part of this series of papers to systems of hard ellipses and ellipsoids. The theoretical machinery needed to treat such particles, including the overlap potentials, is developed in full detail. We describe an algorithm for predicting the time of collision for two moving ellipses or ellipsoids. We present performance results for our implementation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014